A New Algorithm for Computing Upper Bounds for Functional E-MAJSAT

We present a new method for computing upper bounds for an optimization version of the E-MAJSAT problem. This new approach is based on the use of the compilation language d-DNNF that underlies several state-of-the-art algorithms for solving problems related to EMAJSAT. We show that the new bound values dominate those produced by the standard algorithm based on the same approach. Moreover, we present a technique for pruning values from the branch-and-bound search tree based on the information available after each bound computation. We integrate our new techniques into a probabilistic conformant planner ComPlan and demonstrate significant empirical improvements.